0.08/0.14	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.08/0.14	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n026.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1440
0.14/0.35	% WCLimit    : 180
0.14/0.35	% DateTime   : Thu Jul  4 09:15:09 EDT 2024
0.14/0.35	% CPUTime    : 
0.22/0.52	Running higher-order theorem proving
3.81/4.02	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p
69.42/21.38	# Version: 3.2.0-ho
69.42/21.38	# partial match(2): HMLMSMSMSSLCHFA
69.42/21.38	# Preprocessing class: HMLLSMLMSSLCHFA.
69.42/21.38	# Scheduled 4 strats onto 8 cores with 179 seconds (1432 total)
69.42/21.38	# Starting new_ho_10 with 895s (5) cores
69.42/21.38	# Starting sh5l with 179s (1) cores
69.42/21.38	# Starting new_bool_1 with 179s (1) cores
69.42/21.38	# Starting new_bool_2 with 179s (1) cores
69.42/21.38	# new_bool_2 with pid 30635 completed with status 0
69.42/21.38	# Result found by new_bool_2
69.42/21.38	# partial match(2): HMLMSMSMSSLCHFA
69.42/21.38	# Preprocessing class: HMLLSMLMSSLCHFA.
69.42/21.38	# Scheduled 4 strats onto 8 cores with 179 seconds (1432 total)
69.42/21.38	# Starting new_ho_10 with 895s (5) cores
69.42/21.38	# Starting sh5l with 179s (1) cores
69.42/21.38	# Starting new_bool_1 with 179s (1) cores
69.42/21.38	# Starting new_bool_2 with 179s (1) cores
69.42/21.38	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
69.42/21.38	# Search class: HGHSM-SMLM32-DHFFFSBN
69.42/21.38	# Scheduled 5 strats onto 1 cores with 178 seconds (178 total)
69.42/21.38	# Starting new_ho_10 with 107s (1) cores
69.42/21.38	# new_ho_10 with pid 30636 completed with status 0
69.42/21.38	# Result found by new_ho_10
69.42/21.38	# partial match(2): HMLMSMSMSSLCHFA
69.42/21.38	# Preprocessing class: HMLLSMLMSSLCHFA.
69.42/21.38	# Scheduled 4 strats onto 8 cores with 179 seconds (1432 total)
69.42/21.38	# Starting new_ho_10 with 895s (5) cores
69.42/21.38	# Starting sh5l with 179s (1) cores
69.42/21.38	# Starting new_bool_1 with 179s (1) cores
69.42/21.38	# Starting new_bool_2 with 179s (1) cores
69.42/21.38	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
69.42/21.38	# Search class: HGHSM-SMLM32-DHFFFSBN
69.42/21.38	# Scheduled 5 strats onto 1 cores with 178 seconds (178 total)
69.42/21.38	# Starting new_ho_10 with 107s (1) cores
69.42/21.38	# Preprocessing time       : 0.169 s
69.42/21.38	# Presaturation interreduction done
69.42/21.38	
69.42/21.38	# Proof found!
69.42/21.38	# SZS status Theorem
69.42/21.38	# SZS output start CNFRefutation
69.42/21.38	thf(decl_sort1, type, num: $tType).
69.42/21.38	thf(decl_sort2, type, nat: $tType).
69.42/21.38	thf(decl_318, type, one_one_nat: nat).
69.42/21.38	thf(decl_565, type, suc: nat > nat).
69.42/21.38	thf(decl_629, type, bit0: num > num).
69.42/21.38	thf(decl_631, type, one: num).
69.42/21.38	thf(decl_639, type, numeral_numeral_nat: num > nat).
69.42/21.38	thf(decl_679, type, ord_less_nat: nat > nat > $o).
69.42/21.38	thf(decl_694, type, ord_less_eq_nat: nat > nat > $o).
69.42/21.38	thf(decl_742, type, power_power_nat: nat > nat > nat).
69.42/21.38	thf(decl_1087, type, deg: nat).
69.42/21.38	thf(decl_1089, type, ma: nat).
69.42/21.38	thf(decl_1090, type, mi: nat).
69.42/21.38	thf(decl_1094, type, x: nat).
69.42/21.38	thf(fact_467_order__less__not__sym, axiom, ![X652:nat, X653:nat]:(((ord_less_nat @ X652 @ X653)=>~((ord_less_nat @ X653 @ X652)))), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', fact_467_order__less__not__sym)).
69.42/21.38	thf(fact_602_dual__order_Ostrict__trans1, axiom, ![X2:nat, X3:nat, X9134:nat]:((((ord_less_nat @ X9134 @ X3)<=(ord_less_nat @ X9134 @ X2))<=(ord_less_eq_nat @ X2 @ X3))), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', fact_602_dual__order_Ostrict__trans1)).
69.42/21.38	thf(fact_1__C5_Ohyps_C_I8_J, axiom, (ord_less_nat @ ma @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', fact_1__C5_Ohyps_C_I8_J)).
69.42/21.38	thf(fact_2973_Suc__1, axiom, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', fact_2973_Suc__1)).
69.42/21.38	thf(fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062, axiom, ((ord_less_eq_nat @ x @ ma)&(ord_less_eq_nat @ mi @ x)), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062)).
69.42/21.38	thf(fact_377_not__less__iff__gr__or__eq, axiom, ![X664:nat, X665:nat]:((~((ord_less_nat @ X664 @ X665))<=>((ord_less_nat @ X665 @ X664)|((X664)=(X665))))), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', fact_377_not__less__iff__gr__or__eq)).
69.42/21.38	thf(conj_0, conjecture, (ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', conj_0)).
69.42/21.38	thf(fact_512_leD, axiom, ![X4755:nat, X4756:nat]:((~((ord_less_nat @ X4756 @ X4755))<=(ord_less_eq_nat @ X4755 @ X4756))), file('/export/starexec/sandbox/tmp/tmp.zKzXU97vRt/E---3.1_30348.p', fact_512_leD)).
69.42/21.38	thf(c_0_8, plain, ![X652:nat, X653:nat]:(((ord_less_nat @ X652 @ X653)=>~(ord_less_nat @ X653 @ X652))), inference(fof_simplification,[status(thm)],[fact_467_order__less__not__sym])).
69.42/21.38	thf(c_0_9, plain, ![X2:nat, X3:nat, X9134:nat]:(((ord_less_eq_nat @ X2 @ X3)=>((ord_less_nat @ X9134 @ X2)=>(ord_less_nat @ X9134 @ X3)))), inference(fof_simplification,[status(thm)],[fact_602_dual__order_Ostrict__trans1])).
69.42/21.38	thf(c_0_10, plain, ![X25814:nat, X25815:nat]:((~(ord_less_nat @ X25814 @ X25815)|~(ord_less_nat @ X25815 @ X25814))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])).
69.42/21.38	thf(c_0_11, plain, (ord_less_nat @ ma @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), inference(split_conjunct,[status(thm)],[fact_1__C5_Ohyps_C_I8_J])).
69.42/21.38	thf(c_0_12, plain, ((suc @ one_one_nat)=(numeral_numeral_nat @ (bit0 @ one))), inference(split_conjunct,[status(thm)],[fact_2973_Suc__1])).
69.42/21.38	thf(c_0_13, plain, ![X26006:nat, X26007:nat, X26008:nat]:((~(ord_less_eq_nat @ X26006 @ X26007)|(~(ord_less_nat @ X26008 @ X26006)|(ord_less_nat @ X26008 @ X26007)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])).
69.42/21.38	thf(c_0_14, plain, ![X3:nat, X2:nat]:((~((ord_less_nat @ X2 @ X3))|~((ord_less_nat @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_10])).
69.42/21.38	thf(c_0_15, plain, (ord_less_nat @ ma @ (power_power_nat @ (suc @ one_one_nat) @ deg)), inference(rw,[status(thm)],[c_0_11, c_0_12])).
69.42/21.38	thf(c_0_16, plain, ![X3:nat, X4:nat, X2:nat]:(((ord_less_nat @ X4 @ X3)|~((ord_less_eq_nat @ X2 @ X3))|~((ord_less_nat @ X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_13])).
69.42/21.38	thf(c_0_17, plain, (ord_less_eq_nat @ x @ ma), inference(split_conjunct,[status(thm)],[fact_24__092_060open_062x_A_092_060le_062_Ama_A_092_060and_062_Ami_A_092_060le_062_Ax_092_060close_062])).
69.42/21.38	thf(c_0_18, plain, ![X664:nat, X665:nat]:((~(ord_less_nat @ X664 @ X665)<=>((ord_less_nat @ X665 @ X664)|((X664)=(X665))))), inference(fof_simplification,[status(thm)],[fact_377_not__less__iff__gr__or__eq])).
69.42/21.38	thf(c_0_19, negated_conjecture, ~(ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
69.42/21.38	thf(c_0_20, plain, ![X4755:nat, X4756:nat]:(((ord_less_eq_nat @ X4755 @ X4756)=>~(ord_less_nat @ X4756 @ X4755))), inference(fof_simplification,[status(thm)],[fact_512_leD])).
69.42/21.38	thf(c_0_21, plain, ~((ord_less_nat @ (power_power_nat @ (suc @ one_one_nat) @ deg) @ ma)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
69.42/21.38	thf(c_0_22, plain, ![X2:nat]:(((ord_less_nat @ X2 @ ma)|~((ord_less_nat @ X2 @ x)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
69.42/21.38	thf(c_0_23, plain, ![X25816:nat, X25817:nat]:((((ord_less_nat @ X25816 @ X25817)|((ord_less_nat @ X25817 @ X25816)|((X25816)=(X25817))))&((~(ord_less_nat @ X25817 @ X25816)|~(ord_less_nat @ X25816 @ X25817))&(((X25816)!=(X25817))|~(ord_less_nat @ X25816 @ X25817))))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])).
69.42/21.38	thf(c_0_24, negated_conjecture, ~((ord_less_nat @ x @ (power_power_nat @ (numeral_numeral_nat @ (bit0 @ one)) @ deg))), inference(split_conjunct,[status(thm)],[c_0_19])).
69.42/21.38	thf(c_0_25, plain, ![X25914:nat, X25915:nat]:((~(ord_less_eq_nat @ X25914 @ X25915)|~(ord_less_nat @ X25915 @ X25914))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])).
69.42/21.38	thf(c_0_26, plain, ~((ord_less_nat @ (power_power_nat @ (suc @ one_one_nat) @ deg) @ x)), inference(spm,[status(thm)],[c_0_21, c_0_22])).
69.42/21.38	thf(c_0_27, plain, ![X2:nat, X3:nat]:(((ord_less_nat @ X2 @ X3)|(ord_less_nat @ X3 @ X2)|((X2)=(X3)))), inference(split_conjunct,[status(thm)],[c_0_23])).
69.42/21.38	thf(c_0_28, negated_conjecture, ~((ord_less_nat @ x @ (power_power_nat @ (suc @ one_one_nat) @ deg))), inference(rw,[status(thm)],[c_0_24, c_0_12])).
69.42/21.38	thf(c_0_29, plain, ![X3:nat, X2:nat]:((~((ord_less_eq_nat @ X2 @ X3))|~((ord_less_nat @ X3 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_25])).
69.42/21.38	thf(c_0_30, plain, ((power_power_nat @ (suc @ one_one_nat) @ deg)=(x)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26, c_0_27]), c_0_28])).
69.42/21.38	thf(c_0_31, plain, ~((ord_less_nat @ ma @ x)), inference(spm,[status(thm)],[c_0_29, c_0_17])).
69.42/21.38	thf(c_0_32, plain, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15, c_0_30]), c_0_31]), ['proof']).
69.42/21.38	# SZS output end CNFRefutation
69.42/21.38	# Parsed axioms                        : 11424
69.42/21.38	# Removed by relevancy pruning/SinE    : 7988
69.42/21.38	# Initial clauses                      : 8989
69.42/21.38	# Removed in clause preprocessing      : 1956
69.42/21.38	# Initial clauses in saturation        : 7033
69.42/21.38	# Processed clauses                    : 13010
69.42/21.38	# ...of these trivial                  : 333
69.42/21.38	# ...subsumed                          : 3283
69.42/21.38	# ...remaining for further processing  : 9394
69.42/21.38	# Other redundant clauses eliminated   : 2062
69.42/21.38	# Clauses deleted for lack of memory   : 0
69.42/21.38	# Backward-subsumed                    : 74
69.42/21.38	# Backward-rewritten                   : 124
69.42/21.38	# Generated clauses                    : 80099
69.42/21.38	# ...of the previous two non-redundant : 67908
69.42/21.38	# ...aggressively subsumed             : 0
69.42/21.38	# Contextual simplify-reflections      : 99
69.42/21.38	# Paramodulations                      : 77936
69.42/21.38	# Factorizations                       : 14
69.42/21.38	# NegExts                              : 0
69.42/21.38	# Equation resolutions                 : 2121
69.42/21.38	# Disequality decompositions           : 0
69.42/21.38	# Total rewrite steps                  : 32561
69.42/21.38	# ...of those cached                   : 28304
69.42/21.38	# Propositional unsat checks           : 0
69.42/21.38	#    Propositional check models        : 0
69.42/21.38	#    Propositional check unsatisfiable : 0
69.42/21.38	#    Propositional clauses             : 0
69.42/21.38	#    Propositional clauses after purity: 0
69.42/21.38	#    Propositional unsat core size     : 0
69.42/21.38	#    Propositional preprocessing time  : 0.000
69.42/21.38	#    Propositional encoding time       : 0.000
69.42/21.38	#    Propositional solver time         : 0.000
69.42/21.38	#    Success case prop preproc time    : 0.000
69.42/21.38	#    Success case prop encoding time   : 0.000
69.42/21.38	#    Success case prop solver time     : 0.000
69.42/21.38	# Current number of processed clauses  : 3296
69.42/21.38	#    Positive orientable unit clauses  : 822
69.42/21.38	#    Positive unorientable unit clauses: 42
69.42/21.38	#    Negative unit clauses             : 319
69.42/21.38	#    Non-unit-clauses                  : 2113
69.42/21.38	# Current number of unprocessed clauses: 66601
69.42/21.38	# ...number of literals in the above   : 187315
69.42/21.38	# Current number of archived formulas  : 0
69.42/21.38	# Current number of archived clauses   : 5050
69.42/21.38	# Clause-clause subsumption calls (NU) : 17556094
69.42/21.38	# Rec. Clause-clause subsumption calls : 2451840
69.42/21.38	# Non-unit clause-clause subsumptions  : 1885
69.42/21.38	# Unit Clause-clause subsumption calls : 210181
69.42/21.38	# Rewrite failures with RHS unbound    : 0
69.42/21.38	# BW rewrite match attempts            : 1645
69.42/21.38	# BW rewrite match successes           : 539
69.42/21.38	# Condensation attempts                : 13010
69.42/21.38	# Condensation successes               : 52
69.42/21.38	# Termbank termtop insertions          : 3824748
69.42/21.38	# Search garbage collected termcells   : 185053
69.42/21.38	
69.42/21.38	# -------------------------------------------------
69.42/21.38	# User time                : 15.906 s
69.42/21.38	# System time              : 0.170 s
69.42/21.38	# Total time               : 16.076 s
69.42/21.38	# Maximum resident set size: 48112 pages
69.42/21.38	
69.42/21.38	# -------------------------------------------------
69.42/21.38	# User time                : 17.067 s
69.42/21.38	# System time              : 0.194 s
69.42/21.38	# Total time               : 17.261 s
69.42/21.38	# Maximum resident set size: 26860 pages
69.42/21.38	% E---3.1 exiting
69.42/21.38	% E exiting
69.42/21.38	EOF
